The Explanatory Role of Computation in Cognitive Science

Which notion of computation (if any) is essential for explaining cognition? Five answers to this question are discussed in the paper. (1) The classicist answer: symbolic (digital) computation is required for explaining cognition; (2) The broad digital computationalist answer: digital computation broadly construed is required for explaining cognition; (3) The connectionist answer: sub-symbolic computation is required for explaining cognition; (4) The computational neuroscientist answer: neural computation (that, strictly, is neither digital nor analogue) is required for explaining cognition; (5) The extreme dynamicist answer: computation is not required for explaining cognition. The first four answers are only accurate to a first approximation. But the ??devil?? is in the details. The last answer cashes in on the parenthetical ??if any?? in the question above. The classicist argues that cognition is symbolic computation. But digital computationalism need not be equated with classicism. Indeed, computationalism can, in principle, range from digital (and analogue) computationalism through (the weaker thesis of) generic computationalism to (the even weaker thesis of) digital (or analogue) pancomputationalism. Connectionism, which has traditionally been criticised by classicists for being non-computational, can be plausibly construed as being either analogue or digital computationalism (depending on the type of connectionist networks used). Computational neuroscience invokes the notion of neural computation that may (possibly) be interpreted as a sui generis type of computation. The extreme dynamicist argues that the time has come for a post-computational cognitive science. This paper is an attempt to shed some light on this debate by examining various conceptions and misconceptions of (particularly digital) computation.     

Strategy logic

We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL¹, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).     

Fast GL(n)-Invariant Framework for Tensors Regularization

We propose a novel framework for regularization of symmetric positive-definite (SPD) tensors (e.g., diffusion tensors). This framework is based on a local differential geometric approach. The manifold of symmetric positive-definite (SPD) matrices, P _n , is parameterized via the Iwasawa coordinate system. In this framework distances on P _n are measured in terms of a natural GL(n)-invariant metric. Via the mathematical concept of fiber bundles, we describe the tensor-valued image as a section where the metric over the section is induced by the metric over P _n . Then, a functional over the sections accompanied by a suitable data fitting term is defined. The variation of this functional with respect to the Iwasawa coordinates leads to a set of \frac12n(n+1)\frac{1}{2}n(n+1) coupled equations of motion. By means of the gradient descent method, these equations of motion define a Beltrami flow over P _n . It turns out that the local coordinate approach via the Iwasawa coordinate system results in very simple numerics that leads to fast convergence of the algorithm. Regularization results as well as results of fibers tractography for DTI are presented.     

人性化的用户界面

在过去，移动电话只是带内置地址簿的固定电话的无线替代品。向拥有更多连接性、更多数据和更多性能、更精巧设备的加速推进，使广大用户产生了更多、更强烈的市场需求。移动电话的生态系统正努力寻求适当的途径实现数据和服务，并充分友好地为用户所使用。只有语音功能的移动电话市场将会越来越小。     

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism.     

Viscous flow through a bed of settled aggregates: Evolution of tubes void of particles

Observations show that, when a viscous fluid flows vertically through a bed of settled flocculated aggregates, particles are emerged from locations on the upper surface of the bed, as a volcano process, and hollow tubes are created in the bed though the latter remains basically stable. A theoretical model is presented to explain this odd phenomenon from the onset of particle motion to the development of the tubular cavities and the particles' deposits around them. Analytical and numerical calculations are performed to show fluid streamlines and particle trajectories.     

Equi-affine Invariant Geometry for Shape Analysis

Traditional models of bendable surfaces are based on the exact or approximate invariance to deformations that do not tear or stretch the shape, leaving intact an intrinsic geometry associated with it. These geometries are typically defined using either the shortest path length (geodesic distance), or properties of heat diffusion (diffusion distance) on the surface. Both measures are implicitly derived from the metric induced by the ambient Euclidean space. In this paper, we depart from this restrictive assumption by observing that a different choice of the metric results in a richer set of geometric invariants. We apply equi-affine geometry for analyzing arbitrary shapes with positive Gaussian curvature. The potential of the proposed framework is explored in a range of applications such as shape matching and retrieval, symmetry detection, and computation of Voroni tessellation. We show that in some shape analysis tasks, equi-affine-invariant intrinsic geometries often outperform their Euclidean-based counterparts. We further explore the potential of this metric in facial anthropometry of newborns. We show that intrinsic properties of this homogeneous group are better captured using the equi-affine metric.